Sublattices with saturated chains
نویسندگان
چکیده
منابع مشابه
Saturated chains in composition posets
We study some poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The resulting poset N was studied by the author in [5] in relation to non-commutative term orders, and then in [6], where some results about generating functions for standard path...
متن کاملEnumeration of saturated chains in Dyck lattices
We determine a general formula to compute the number of saturated chains in Dyck lattices, and we apply it to find the number of saturated chains of length 2 and 3. We also compute what we call the Hasse index (of order 2 and 3) of Dyck lattices, which is the ratio between the total number of saturated chains (of length 2 and 3) and the cardinality of the underlying poset.
متن کاملChains of saturated models in AECs
We study when a union of saturated models is saturated in the framework of tame abstract elementary classes (AECs) with amalgamation. We prove: Theorem 0.1. If K is a tame AEC with amalgamation satisfying a natural definition of superstability (which follows from categoricity in a high-enough cardinal), then for all high-enough λ: (1) The union of an increasing chain of λ-saturated models is λ-...
متن کاملMaximal Sublattices and Frattini Sublattices of Bounded Lattices
We will address these questions in order, and provide good partial answers, especially for nite lattices which are bounded homomorphic images of a free lattice. Recall that a nite lattice is bounded if and only if it can be obtained from the one element lattice by a sequence of applications of Alan Day's doubling construction for intervals. In particular, nite distributive lattices are bounded....
متن کاملSublattices of Finite Index
Assuming the Gowers Inverse conjecture and the Möbius conjecture for the finite parameter s, Green-Tao verified Dickson’s conjecture for lattices which are ranges of linear maps of complexity at most s. In this paper, we reformulate GreenTao’s theorem on Dickson’s conjecture, and prove that, if L is the range of a linear map of complexity s, and L1 is a sublattice of L of finite index, then L1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1975
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1975.101338